1945D - Seraphim the Owl - CodeForces Solution

import heapq
from math import pi,sqrt,ceil,floor,log2,log10
from collections import deque,defaultdict,Counter
from sys import setrecursionlimit
setrecursionlimit(1_000_000)


def gcd(a,b):
    while(b):
        a,b = b,a % b

    return a

def lcm(a,b):
    return a * b // gcd(a,b)


def minput():
    return map(int,input().split())

def linput():
    return list(map(int,input().split()))


MOD = int(1e9) + 7
sz = int(1e5) + 5
INT_MAX = float('inf')


def solve():
    n,m = minput()

    arr = [linput() for _ in range(2)]

    sum = 0
    res = INT_MAX

    for i in range(n - 1,-1,-1):
        if(i + 1 <= m):
            res = min(res,sum + arr[0][i])

        sum += min(arr[0][i],arr[1][i])

    print(res)




def main():
    t = int(input())

    for _ in range(t):
        solve()


if __name__ == '__main__':
    main()